A parallel algorithm for generating combinations
نویسندگان
چکیده
منابع مشابه
A Parallel Algorithm for Enumerating Combinations
In this paper we propose an efficient parallel algorithm with simple static and dynamic scheduling for generating combinations. It can use any number of processors (NP ≤ n−m+ 1) in order to generate the set of all combinations of C(n,m). The main characteristic of this algorithm is to require no integer larger than n during the whole computation. The performance results show that even without a...
متن کاملA Novel Parallel Algorithm for Enumerating Combinations
In this paper we propose a new algorithm for parallel enumeration of combinations. This algorithm uses N processing elements (or PEs). We prove that, if N and M are relatively prime, each PE will do the same operations and generate the same number of distinct combinations so that the computational load is well balanced. The algorithm has an important application in solving the problem of fault ...
متن کاملA Simple Systolic Algorithm for Generating Combinations in Lexicographic Order
A systolic algorithm is described for generating, in lexicographlcally ascending order, all combinations of m objects chosen from {1 .... ,n). The algorithm is designed to he executed on a linear array of m processors, each having constant size memory, and each being responsible for producing one dement of a given combination. There is a constant delay per combination, leading to an O(C(m, n)) ...
متن کاملThe IUFP Algorithm for Generating Simulation Heart
In all systems simulation, random variates are considered as a main factor and based of simulation heart. Actually, randomization is inducted by random variates in the simulation. Due to the importance of such a problem, a new method for generation of random variates from continuous distributions is presented in this paper. The proposed algorithm, called uniform fractional part (UFP) is simpler...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1989
ISSN: 0898-1221
DOI: 10.1016/0898-1221(89)90052-7